On Randomly 3-axial Graphs
نویسندگان
چکیده
A graph G , every vertex of which has degree at least three, is randomly 3-axial if for each vertex V of G , any ordered collection of three paths in G of length one with initial vertex V can be cyclically randomly extended to produce three internally disjoint paths which contain all the vertices of G . Randomly 3-axial graphs of order p > k are characterized for p ^ 1 (mod 3) , and are shown to be either complete graphs or certain regular complete bipartite graphs.
منابع مشابه
An Heuristic for Graph Symmetry Detection
We give a short introduction to an heuristic to nd automorphisms in a graph such as axial, central or rotational symmetries. Using technics of factorial analysis, we embed the graph in an Euclidean space and try to detect and interpret the geometric symmetries of of the embedded graph. 1. Introduction Testing whether a graph has any axial (rotational, central, respectively) symmetry is a NP-com...
متن کاملA Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs
A graph g is called a maximum common subgraph of two graphs, g1 and g2, if there exists no other common subgraph of g1 and g2 that has more nodes than g. For the maximum common subgraph problem, exact and inexact algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance. In this paper, two exact algorithms for maximum common s...
متن کاملCurrent algebra derivation of temperature dependence of hadron couplings with currents
The vector and the axial-vector meson couplings with the vector and the axial-vector currents respectively at finite temperature have been obtained in Ref. [1] by calculating all the relevant one-loop Feynman graphs with vertices obtained from the effective chiral Lagrangian. On the other hand, the same couplings were also derived in Ref. [3] by applying the method of current algebra and the hy...
متن کاملA short update on equipackable graphs
A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P3-equipackable graphs with all valencies at least two.
متن کاملLimits of randomly grown graph sequences
3 Convergent graph sequences and their limits 8 3.1 Growing uniform attachment graphs . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2 Growing ranked attachment graphs . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3 Growing prefix attachment graph . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.4 Preferential attachment graph on n fixed nodes . . . . . . . . . . . . ....
متن کامل